Markov Chains and Unambiguous Büchi Automata
نویسندگان
چکیده
Unambiguous automata, i.e., nondeterministic automata with the restriction of having at most one accepting run over a word, have the potential to be used instead of deterministic automata in settings where nondeterministic automata can not be applied in general. In this paper, we provide a polynomially time-bounded algorithm for probabilistic model checking of discrete-time Markov chains against unambiguous Büchi automata specifications and report on our implementation
منابع مشابه
Model Checking Markov Chains Against Unambiguous Buchi Automata
An automaton is unambiguous if each word has at most one accepting run and separated if no word is accepted from two distinct states. The classical translation of LTL formulas to Büchi automata [5] produces unambiguous separated automata since the states of such automata correspond to complete subformula types. Motivated by this observation, Couvreur et al. [3] present a polynomialtime algorith...
متن کاملComplementing Semi-deterministic Büchi Automata
We introduce an efficient complementation technique for semi-deterministic Büchi automata, which are Büchi automata that are deterministic in the limit: from every accepting state onward, their behaviour is deterministic. It is interesting to study semi-deterministic automata, because they play a role in practical applications of automata theory, such as the analysis of Markov decision processe...
متن کاملEquivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
We consider the inclusion and equivalence problem for unambiguous Büchi automata. We show that for a strong version of unambiguity introduced by Carton and Michel these two problems are solvable in polynomial time. We generalize this to Büchi automata with a fixed finite degree of ambiguity in the strong sense. We also discuss the problems that arise when considering the decision problems for t...
متن کاملRecurrence and Transience for Probabilistic Automata
In a context of ω-regular specifications for infinite execution sequences, the classical Büchi condition, or repeated liveness condition, asks that an accepting state is visited infinitely often. In this paper, we show that in a probabilistic context it is relevant to strengthen this infinitely often condition. An execution path is now accepting if the proportion of time spent on an accepting s...
متن کاملLazy Probabilistic Model Checking without Determinisation
The bottleneck in the quantitative analysis of Markov chains and Markov decision processes against specifications given in LTL or as some form of nondeterministic Büchi automata is the inclusion of a determinisation step of the automaton under consideration. Such determinisation constructions are notoriously difficult and cumbersome to implement. In this paper we argue that applying this step i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016